Lexical Operations in a Uni cation-based Framework
نویسندگان
چکیده
We consider lexical operations and their representation in a uniication based lexicon and the role of lexical semantic information. We describe a uniied treatment of the linguistic aspects of sense extension and derivational morphological processes which delimit the range of possible coercions between lexemes and give a preliminary account of how default interpretations may arise.
منابع مشابه
Opacity in the lexicon: a generative lexicon approach to Korean VV compounds
is paper aims at providing a formal description of three types of Korean compounds made up of two verbs (VV compounds) in the Generative Lexicon framework. I will rst discuss several properties commonly ascribed to VV compounds and address the problem of identifying lexical VV compounds as opposed to SVCs and similar constructions. I will then argue that the complex semantic structure and the ...
متن کاملEstimators for Stochastic \Uni cation-Based" Grammars
Log-linear models provide a statistically sound framework for Stochastic \Uniication-Based" Grammars (SUBGs) and stochastic versions of other kinds of grammars. We describe two computationally-tractable ways of estimating the parameters of such grammars from a training corpus of syntactic analyses, and apply these to estimate a stochastic version of Lexical-Functional Grammar.
متن کاملLogic Program Schemas, Constraints and Semi-Uni cation
Program schemas are known to be useful in di erent applications such as program synthesis, transformation, analysis, debugging, teaching : : :This paper tackles two complementary aspects of program schemas. We rst propose a language for the description of program schemas. It is based on a subset of second-order logic, enhanced with constraints and speci c features of program schemas. One of the...
متن کاملExploiting auxiliary distributions in stochastic uni cation-based grammars
This paper describes a method for estimating conditional probability distributions over the parses of \uniication-based" grammars which can utilize auxiliary distributions that are estimated by other means. We show how this can be used to incorporate information about lexical selectional preferences gathered from other sources into Stochastic \Uniication-based" Grammars (SUBGs). While we apply ...
متن کاملSyntactic Uni cation Problems under Constrained Substitutions
Some kind of practical problems such as security veri cation of cryptographic protocols can be described as a problem to accomplish a given purpose by using limited operations and limited materials only. To model such problems in a natural way, uni cation problems under constrained substitutions have been proposed. This paper is a collection of results on the decidability and the computational ...
متن کامل